Rainbow connection and minimum degree
نویسندگان
چکیده
منابع مشابه
Rainbow connection and minimum degree
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. Krivelevich and Yuster have shown that a connected graph G with n vertices has rc(G) < 20n δ(G) [M. Krivelevich and...
متن کاملRainbow Connection in Graphs with Minimum Degree Three
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. This concept of rainbow connection in graphs was recently introduced by Chartrand et al.. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. The computation of rc(G) ...
متن کاملOn forbidden subgraphs and rainbow connection in graphs with minimum degree 2
A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...
متن کاملCharacterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
A connected edge-colored graph G is rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors; the rainbow connection number rc(G) of G is the minimum number of colors that are needed in order to make G rainbow connected. In this paper, we complete the discussion of pairs (X,Y ) of connected graphs for which there is a constant kXY suc...
متن کاملThe rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edgeconnected. We prove that if G has n vertices and minimum degree δ then rc(G) < 20n/δ. This solves open problems from [5] and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.009